	/*
	* Taras Boichenko , Kiev 2012
	* PrimeNumbers 
	* The program which find prime numbers smaller or equal to the inputted.
	*/
	
	import java.util.Scanner;
	
	       public class PrimeNumbers {
		      static final int PossiblePrime = 2;
	             public static boolean indeedPrimeNumber(int yourinputNumber) {
	
	
	                 for (int i = PossiblePrime; i < yourinputNumber; i++) {
	                     if (yourinputNumber % i == 0) {
	                       return false;
	                       }
                      }
                           return true;
                   }
                 public static void main(String[] args) {
                      Scanner in = new Scanner(System.in);
                      System.out.println("Please input a number");
                      int yourinputNumber = in.nextInt();
                          if (yourinputNumber > 0) {
    
                     for (int i = PossiblePrime; i < yourinputNumber; i++) {
                          if (indeedPrimeNumber(i)) {
                      
                      System.out.println("Prime number:" + i);
      
                           }
                       }
                } else {
                      System.out.println("Please, enter number more than 0");
                }
              in.close();
     }
 } 
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	       